/**
*      author: Y_Yao
*      created: 2025-02-08 12:17:20
**/

#include<bits/stdc++.h>

#define int LL
using namespace std;
using LL = long long;
const LL LLINF = 1e18;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 7;
const int M = 64;
int n,k;
int X[M][N],a[N];

void solve()
{
    cin >> n >> k;
    for(int i = 1;i <= n;i++)
    {
        cin >> X[0][i];
    }
    for(int i = 1;i <= n;i++)
    {
        cin >> a[i];
    }

    for(int i = 1;i < M;i++)
    {
        for(int j = 1;j <= n;j++)
        {
            X[i][j] = X[i-1][X[i-1][j]];
        }
    }

    for(int i = 1;i <= n;i++)
    {
        int p = i;
        for(int j = 0;j < M;j++)
        {
            if(k >> j & 1)
            {
                p = X[j][p];
            }
        }
        cout << a[p] << " ";
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}